chi|ro|graph

chi|ro|graph
chi|ro|graph «KY ruh graf, -grahf», noun.
1. any one of various formally written or signed legal or other documents.
2. a writing executed in duplicate on a single sheet, and then divided, as through letters, or along an indented line, between the copies.
3. a document in one's own handwriting.
╂[< Latin chirographum < Greek cheirógraphon, neuter of cheirógraphos written with the hand < cheír, -os hand + gráphein write]

Useful english dictionary. 2012.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • chi|ro|graph|ic — «KY ruh GRAF ihk», adjective. of chiragraphy …   Useful english dictionary

  • chi|na|graph pencil — «CHY nuh graf», a special pencil for writing on china and glassware …   Useful english dictionary

  • chi|ro|graph|i|cal — «KY ruh GRAF uh kuhl», adjective. = chirographic. (Cf. ↑chirographic) …   Useful english dictionary

  • chi — chi·ri·mia; chi·ri·no; chi·ri·pa; chi·ri·pá; chi·ri·qui; chi·ri·vi·ta; chi·ro; chi·ro·cen·trus; chi·rog·a·le; chi·rog·no·mist; chi·rog·no·my; chi·ro·graph; chi·rog·ra·phary; chi·rog·ra·pher; chi·ro·graph·ic; chi·rog·ra·phy; chi·ro·man·cer;… …   English syllables

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • Chi (mythology) — Han Dynasty jade ring of a chi 螭 dragon …   Wikipedia

  • Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

  • Kritischer Graph — Ein kritischer Graph ist ein Begriff aus der Graphentheorie, der 1965 vom Vadim G. Vizing zur Untersuchung von Kantenfärbungen eingeführt worden ist. Er beschreibt eine Sorte von Graphen, deren chromatischer Index sich durch das Entfernen einer… …   Deutsch Wikipedia

  • Bogen (Graph) — Dieses Stichwortverzeichnis enthält kurze Definitionen und Erklärungen zu den wichtigsten graphentheoretischen Begriffen. A Abstand Siehe: Distanz. Achromatische Zahl Die achromatische Zahl ψ(G) eines Graphen G ist die größte Zahl k, für die G… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”